package com.leetcode.week.week292;

/**
 * @author angzhijin
 * @Description
 * @create 2022-05-08 11:41 上午
 */
public class week4 {

    public static void main(String[] args) {

    }

    public static boolean hasValidPath(char[][] grid) {
        return true;
    }

    public static void dfs(char[][] grid,int x, int y, String str){
        if (x==grid.length-1 && y== grid.length-1){
            isValid(str+grid[x][y]);
        }

    }

    public static boolean isValid(String str) {
        return false;
    }
}
